Rigorous Bounds on the Fast Dynamogrowth Rate

نویسندگان

  • I Klapper
  • L S Young
چکیده

The fast dynamo growth rate for a C k+1 map or ow is bounded above by topo-logical entropy plus a 1=k correction. The proof uses techniques of random maps combined with a result of Yomdin relating curve growth to topological entropy. This upper bound implies the following anti-dynamo theorem: in C 1 systems fast dynamo action is not possible without the presence of chaos. In addition topological entropy is used to construct a lower bound for the fast dynamo growth rate in the case R m = 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigorous Bounds on the Fast Dynamogrowth Rate Involving Topologicalentropyi

The fast dynamo growth rate for a C k+1 map or ow is bounded above by topo-logical entropy plus a 1=k correction. The proof uses techniques of random maps combined with a result of Yomdin relating curve growth to topological entropy. This upper bound implies the following anti-dynamo theorem: in C 1 systems fast dynamo action is not possible without the presence of chaos. In addition topologica...

متن کامل

Bias-Variance Error Bounds for Temporal Difference Updates

We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds prove exponentially fast convergence, with both the rate of convergence and the asymptote strongly dependent on the length of the backups k or the parameter . Our bounds give formal verification to the long-standing intui...

متن کامل

On Improved Bounds on Coded Communications over Interleaved Fading Channels, with Applications to Turbo Codes

We study here rigorous analytical upper bounds on the block and bit error probabilities of ML decoded block codes, operating over fully interleaved Rician fading channels. The proposed improved bounding technique is a modified and generalized version of the recently introduced bounds for the AWGN channel by Duman and Salehi, which are based on modifying the classical Gallager technique. The adv...

متن کامل

Diffusion-controlled reactions: Mathematical formulation, variational principles, and rigorous bounds

This paper is concerned with the problem of predicting the effective rate constant k associated with diffusion-controlled reactions in media composed of static and reactive traps (sinks) which are generally distributed randomly throughout a region containing reactive particles. The effective equation for diffusion-controlled reactions is derived using the method of homogenization. This leads to...

متن کامل

Computer-assisted bounds for the rate of decay of correlations

The rate of decay of correlations quantitatively describes the rate at which a chaotic system “mixes” the state space. We present a new rigorous method to estimate a bound for this rate of mixing. The technique may be implemented on a computer and is applicable to both multidimensional expanding and hyperbolic systems. The bounds produced are significantly less conservative than current rigorou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994